Steady State Analysis of Random Early Detection Gateway

In a packet-switched network, a feedback-based congestion control mechanism is essential to provide data transfer services efficiently. Its main objective is to prevent packet losses in the network, and to utilize network resources effectively. The current Internet uses a window-based flow control mechanism in its TCP (Transmission Control Protocol), as the feedback-based congestion control mechanism. As an example, a version of TCP mechanism called TCP Reno uses packet losses in the network as feedback information from the network since packet loss implies congestion occurrence in the network [1, 2]. Until packet loss occurs in the network, TCP Reno gradually increases its window size. As the window size exceeds its available bandwidth, excess packets are absorbed by the buffer of an intermediate gateway for some period. If the window size increases further, the buffer of the gateway overflows, leading packet losses. The source host detects occurrence of packet losses in the network by, for example, receiving more than three duplicate ACKs, and quickly reduces its window size. After reduction of the window size, congestion in the network will be relieved. Once congestion in the network is over, the source host increases its window size again. In short, the congestion control mechanism of TCP first increases its window size, and as soon as it detects packet losses in the network, it reduces its window size. The congestion control mechanism of TCP repeats this process indefinitely during the connection. The congestion control mechanism of TCP was designed to work without any knowledge on the gateway’s